Approximations for the Moments of Nonstationary and State Dependent Birth-Death Queues

نویسندگان

  • Stefan Engblom
  • Jamol Pender
چکیده

In this paper we propose a new method for approximating the nonstationary moment dynamics of one dimensional Markovian birth-death processes. By expanding the transition probabilities of the Markov process in terms of Poisson-Charlier polynomials, we are able to estimate any moment of the Markov process even though the system of moment equations may not be closed. Using new weighted discrete Sobolev spaces, we derive explicit error bounds of the transition probabilities and new weak a priori estimates for approximating the moments of the Markov processs using a truncated form of the expansion. Using our error bounds and estimates, we are able to show that our approximations converge to the true stochastic process as we add more terms to the expansion and give explicit bounds on the truncation error. As a result, we are the first paper in the queueing literature to provide error bounds and estimates on the performance of a moment closure approximation. Lastly, we perform several numerical experiments for some important models in the queueing theory literature and show that our expansion techniques are accurate at estimating the moment dynamics of these Markov process with only a few terms of the expansion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The truncated normal distribution: Applications to queues with impatient customers

Motivated by heavy traffic approximations for single server queueswith abandonment, we provide an exact expression for the moments of the truncated normal distribution using Stein’s lemma. Consequently, our moment expressions provide insight into the steady state skewness and kurtosis dynamics of single server queues with impatient customers. Moreover, based on the truncated normal distribution...

متن کامل

Moments of first passage times in general birth-death processes

We consider ordinary and conditional first passage times in a general birth–death process. Under existence conditions, we derive closed-form expressions for the kth order moment of the defined random variables, k ≥ 1. We also give an explicit condition for a birth–death process to be ergodic degree 3. Based on the obtained results, we analyze some applications for Markovian queueing systems. In...

متن کامل

Nonstationary Erlang Loss Queues and Networks

ALNOWIBET, KHALID ABDULAZIZ Nonstationary Erlang Loss Queues and Networks. (Under the direction of Dr. Harry Perros) The nonstationary Erlang loss model is a queueing system consisting of a finite number of servers and no waiting room with a nonstationary arrival process or a time-dependent service rate. The Erlang loss model is commonly used to model and evaluate many communication systems. Of...

متن کامل

Analytic study of multiplexing effects in two-class queues with correlations

An improved (i.e., reduced) quasi-birth-death representation of a FIFO queue with two separate traffic streams (and dedicated service processes) is combined with ETAQA truncation to yield scalable finite approximations of the two departure processes from this queue. Via matrix-analytic techniques, these models may be used to study various arrival/service interdependences between the two traffic...

متن کامل

On Mn(t)/Mn(t)/S queues with catastrophes

The simplest (stationary) queueing models with catastrophes have been studied some years ago, see for instance [1–6, 9]. Namely, when the queue is not empty, catastrophes may occur with the respective rates. The effect of each catastrophe is to make the queue instantly empty. Simultaneously, the system becomes ready to accept new customers. Nonstationary Markovian queueing models (birthdeath pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1406.6164  شماره 

صفحات  -

تاریخ انتشار 2014